Swarming on Random Graphs
نویسندگان
چکیده
منابع مشابه
Swarming on Random Graphs
We consider a compromise model in one dimension in which pairs of agents interact through first-order dynamics that involve both attraction and repulsion. In the case of all-to-all coupling of agents, this system has a lowest energy state in which half of the agents agree upon one value and the other half agree upon a different value. The purpose of this paper is to study the behavior of this c...
متن کاملSwarming on Random Graphs II
We consider an individual-based model where agents interact over a random network via firstorder dynamics that involve both attraction and repulsion. In the case of all-to-all coupling of agents in Rd this system has a lowest energy state in which an equal number of agents occupy the vertices of the d-dimensional simplex. The purpose of this paper is to study the behavior of this model when the...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملRandom graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2013
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-012-0680-x